LSDX: A New Labelling Scheme for Dynamically Updating XML Data
نویسندگان
چکیده
In order to facilitate query processing for XML data, several path indexing, labelling and numbering scheme have been proposed. However, if XML data need to be updated frequently, most of these approaches will need to re-compute existing labels which is rather time consuming. In this paper, we propose a new Labelling Scheme for Dynamic XML data (LSDX) that supports the representation of the ancestor – descendant relationship and sibling relationship between nodes. Moreover, LSDX supports the process of updating XML data without the need of re-labelling existing labels, hence facilitating fast update. Some experimental works have been conducted to show its effectiveness.
منابع مشابه
Algorithms for Indexing Dynamic XML Data
Some approaches such as path indexing, labeling, and numbering scheme have been proposed in order to facilitate query of XML data. The indexes derived by these approaches must be rebuilt if XML data is updated. The method LSDX (Labeling Scheme for Dynamic XML data) can dynamically add new labels without updating existing old labels. However, there are two defects in LSDX. The first defect is th...
متن کاملA persistent labelling scheme for XML and tree databases
With the growing importance of XML in data exchange, much research has been done in providing flexible query facilities to extract data from structured XML documents. Thereby, several path indexing, labelling and numbering scheme have been proposed. However, if XML data need to be updated frequently, most of these approaches will need to re-compute existing labels which is rather time consuming...
متن کاملEnumerating XML Data for Dynamic Updating
In this paper, a new mapping model, called n-INode, is presented and it is used to support dynamic updating of XML data flexibly. One key feature of n-INode is the use of multi-dimensional numbering scheme to verify the containment relationships between XML nodes The preliminary experiments show that n-INode supports dynamic updating of XML documents effectively and efficiently..
متن کاملChaotic Genetic Algorithm based on Explicit Memory with a new Strategy for Updating and Retrieval of Memory in Dynamic Environments
Many of the problems considered in optimization and learning assume that solutions exist in a dynamic. Hence, algorithms are required that dynamically adapt with the problem’s conditions and search new conditions. Mostly, utilization of information from the past allows to quickly adapting changes after. This is the idea underlining the use of memory in this field, what involves key design issue...
متن کاملCompacting XML Structures Using a Dynamic Labeling Scheme
Due to the growing popularity of XML as a data exchange and storage format, the need to develop efficient techniques for storing and querying XML documents has emerged. A common approach to achieve this is to use labeling techniques. However, their main problem is that they either do not support updating XML data dynamically or impose huge storage requirements. On the other hand, with the verbo...
متن کامل